The vanishing discount approach in Markov chains with risk-sensitive criteria

نویسندگان

  • Rolando Cavazos-Cadena
  • Emmanuel Fernández-Gaucherand
چکیده

In this paper stochastic dynamic systems are studied, modeled by a countable state space Markov cost/reward chain, satisfying a Lyapunov-type stability condition. For an infinite planning horizon, risk-sensitive (exponential) discounted and average cost criteria are considered. The main contribution is the development of a vanishing discount approach to relate the discounted criterion problem with the average criterion one, as the discount factor increases to one, i.e., no discounting. In comparison to the well-established risk-neutral case, our results are novel and reveal several fundamental and surprising differences. For example, the limit of the (normalized) discounted costs, as the discount vanishes, is not equal to the average cost, but rather equal to an arithmetic mean of the average cost over a range of values for the risk sensitivity coefficient. Other significant contributions made in this paper are the use of convex analytic arguments to obtain appropriately convergent sequences and a verification theorem for the case of unbounded solutions to the average cost Poisson equation arising in the risk-sensitive case. Also of importance is the fact that our developments are very much self-contained and employ only basic probabilistic and analysis principles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recent Results in Controlled Markov Chains with Risk Sensitive Average Criteria: the Vanishing Discount Approach

Countable state space Markov cost/ reward chains, satisfying a Lyapunov-t ype stability condition, are considered in this work. For an infinite planning horizon, risk sensitive (exponential) discounted and average cost criteria are considered. The main contribution is the development of a vanishing discount approach to relate the discounted criterion problem with the average criterion one, as t...

متن کامل

Existence of Risk Sensitive Optimal

In this paper we are concerned with the existence of optimal stationary policies for innnite horizon risk sensitive Markov control processes with denu-merable state space, unbounded cost function, and long run average cost. Introducing a discounted cost dynamic game, we prove that its value function satisses an Isaacs equation, and its relationship with the risk sensitive control problem is stu...

متن کامل

An Optimal Tax Relief Policy with Aligning Markov Chain and Dynamic Programming Approach

Abstract In this paper, Markov chain and dynamic programming were used to represent a suitable pattern for tax relief and tax evasion decrease based on tax earnings in Iran from 2005 to 2009. Results, by applying this model, showed that tax evasion were 6714 billion Rials**. With 4% relief to tax payers and by calculating present value of the received tax, it was reduced to 3108 billion Rials. ...

متن کامل

Existence of Risk Sensitive Optimal Stationary Policies for Controlled Markov Processes

In this paper we are concerned with the existence of optimal stationary policies for in nite horizon risk sensitive Markov control processes with denumerable state space, unbounded cost function, and long run average cost. Introducing a discounted cost dynamic game, we prove that its value function satis es an Isaacs equation, and its relationship with the risk sensitive control problem is stud...

متن کامل

Financial Risk Modeling with Markova Chain

Investors use different approaches to select optimal portfolio. so, Optimal investment choices according to return can be interpreted in different models. The traditional approach to allocate portfolio selection called a mean - variance explains. Another approach is Markov chain. Markov chain is a random process without memory. This means that the conditional probability distribution of the nex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2000